Comparison of State-Preserving vs. Non-State-Preserving Leakage Control in Caches

نویسندگان

  • Dharmesh Parikh
  • Yan Zhang
  • Karthik Sankaranarayanan
  • Kevin Skadron
  • Mircea Stan
چکیده

This paper compares the effectiveness of state-preserving and non-state-preserving techniques for leakage control in caches by comparing drowsy cache and gated-V for data caches using 70nm technology parameters. To perform the comparison, we use “HotLeakage”, a new architectural model for subthreshold and gate leakage that explicitly models the effects of temperature, voltage, and parameter variations, and has the ability to recalculate leakage currents dynamically as temperature and voltage change at runtime due to operating conditions, DVS techniques, etc. By comparing drowsy-cache and gated-V at different L2 latencies, we are able to identify a range of operating parameters at which gated-V is more energy efficient than drowsy-cache, even though gated-V does not preserve data in cache lines that have been deactivated. We are also able to show potential further benefits of gated-V if an effective dynamic adaptation technique can be found. This paper duplicates some of the findings of both the drowsycache and “cache-decay” papers, but also debunks a fairly widespread belief that state-preserving techniques are inherently superior to non-state-preserving techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantitative Evaluation of State-Preserving Leakage Reduction Algorithm for L1 Data Caches

† The author is with Department of electronics engineering and computer Science at Fukuoka University , Fukuoka-shi, 814-0180, ‡ The author is with Institute of Systems & Information Technologies/KYUSHU, Fukuoka-shi, 814-0001 § The author is with Department of Informatics at Kyushu University, Fukuoka-shi, 816-8580 Quantitative Evaluation of State-Preserving Leakage Reduction Algorithm for L1 D...

متن کامل

Drowsy Caches

On-chip caches represent a sizable fraction of the total power consumption of microprocessors. Although large caches can significantly improve performance, they have the potential to increase power consumption. As feature sizes shrink, the dominant component of this power loss will be leakage. However, during a fixed period of time the activity in a cache is only centered on a small subset of t...

متن کامل

Robust Fixed-order Gain-scheduling Autopilot Design using State-space Stability-Preserving Interpolation

In this paper, a robust autopilot is proposed using stable interpolation based on Youla parameterization. The most important condition of stable interpolation between local controllers is the preservation of stability so that each local controller can ensure stability for an open neighborhood around a nominal point. The proposed design used fixed-order robust controller with parameter-dependent...

متن کامل

Linear Maps Preserving Invertibility or Spectral Radius on Some $C^{*}$-algebras

Let $A$ be a unital $C^{*}$-algebra which has a faithful state. If $varphi:Arightarrow A$ is a unital linear map which is bijective and invertibility preserving or surjective and spectral radius preserving, then $varphi$ is a Jordan isomorphism. Also, we discuss other types of linear preserver maps on $A$.

متن کامل

Common fixed point results for graph preserving mappings in parametric $N_b$-metric spaces

In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of graph preserving mappings in parametric $N_b$-metric spaces. As some consequences of this study, we obtain several important results in parametric $b$-metric spaces, parametric $S$-metric spaces and parametric $A$-metric spaces. Finally, we provide some illustrative examples to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003